Low-Complexity Weak Pseudorandom Functions in $$\mathtt {AC}0[\mathtt {MOD}2]$$
نویسندگان
چکیده
A weak pseudorandom function (WPRF) is a keyed \(f_k:\{0,1\}^n\rightarrow \{0,1\}\) such that, for random key k, collection of samples \((x, f_k(x))\), uniformly inputs x, cannot be efficiently distinguished from totally input-output pairs (x, y). We study WPRFs in \(\mathtt {AC}0[\mathtt {MOD}2] \), the class functions computable by {AC}0 \) circuits with parity gates, making following contributions.
منابع مشابه
Weak Pseudorandom Functions in Minicrypt
A family of functions is weakly pseudorandom if a random member of the family is indistinguishable from a uniform random function when queried on random inputs. We point out a subtle ambiguity in the definition of weak PRFs: there are natural weak PRFs whose security breaks down if the randomness used to sample the inputs is revealed. To capture this ambiguity we distinguish between public-coin...
متن کاملPseudorandom Generators for Low Sensitivity Functions
A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...
متن کاملPseudorandom Functions in Almost Constant Depth from Low-Noise LPN
Pseudorandom functions (PRFs) play a central role in symmetric cryptography. While in principle they can be built from any one-way functions by going through the generic HILL (SICOMP 1999) and GGM (JACM 1986) transforms, some of these steps are inherently sequential and far from practical. Naor, Reingold (FOCS 1997) and Rosen (SICOMP 2002) gave parallelizable constructions of PRFs in NC and TC ...
متن کاملLow-Complexity Cryptographic Hash Functions
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output. Despite t...
متن کاملConstraining Pseudorandom Functions Privately
In a constrained pseudorandom function (PRF), the master secret key can be used to derive constrained keys, where each constrained key k is constrained with respect to some Boolean circuit C. A constrained key k can be used to evaluate the PRF on all inputs x for which C(x) = 1. In almost all existing constrained PRF constructions, the constrained key k reveals its constraint C. In this paper w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-84259-8_17